首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   24351篇
  免费   4066篇
  国内免费   3106篇
化学   17832篇
晶体学   258篇
力学   1649篇
综合类   237篇
数学   2878篇
物理学   8669篇
  2024年   31篇
  2023年   406篇
  2022年   485篇
  2021年   724篇
  2020年   916篇
  2019年   924篇
  2018年   761篇
  2017年   663篇
  2016年   1144篇
  2015年   1193篇
  2014年   1369篇
  2013年   1801篇
  2012年   2106篇
  2011年   2310篇
  2010年   1521篇
  2009年   1514篇
  2008年   1569篇
  2007年   1407篇
  2006年   1417篇
  2005年   1192篇
  2004年   1075篇
  2003年   857篇
  2002年   857篇
  2001年   737篇
  2000年   551篇
  1999年   496篇
  1998年   418篇
  1997年   356篇
  1996年   359篇
  1995年   339篇
  1994年   320篇
  1993年   245篇
  1992年   258篇
  1991年   222篇
  1990年   194篇
  1989年   158篇
  1988年   99篇
  1987年   95篇
  1986年   83篇
  1985年   85篇
  1984年   50篇
  1983年   50篇
  1982年   42篇
  1981年   26篇
  1980年   19篇
  1979年   12篇
  1976年   7篇
  1975年   7篇
  1971年   6篇
  1957年   8篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
鉴于条件风险价值CVaR具有风险度量的合理性以及两基金分离定理对证券投资的重要意义,以CVaR作为风险度量研究两基金分离定理.在组合收益率服从正态分布的假设下,分别就投资组合含有或没有无风险资产的情形提出并证明了两基金分离定理;放开方差-协方差矩阵为非奇异这一通常假设,证明了CVaR风险度量下的两基金分离定理依然成立.  相似文献   
992.
A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.  相似文献   
993.
We consider the problem of parameter estimation in both linear and nonlinear ordinary differential equation(ODE) models. Nonlinear ODE models are widely used in applications. But their analytic solutions are usually not available. Thus regular methods usually depend on repetitive use of numerical solutions which bring huge computational cost. We proposed a new two-stage approach which includes a smoothing method(kernel smoothing or local polynomial fitting) in the first stage, and a numerical discretization method(Eulers discretization method, the trapezoidal discretization method,or the Runge–Kutta discretization method) in the second stage. Through numerical simulations, we find the proposed method gains a proper balance between estimation accuracy and computational cost.Asymptotic properties are also presented, which show the consistency and asymptotic normality of estimators under some mild conditions. The proposed method is compared to existing methods in term of accuracy and computational cost. The simulation results show that the estimators with local linear smoothing in the first stage and trapezoidal discretization in the second stage have the lowest average relative errors. We apply the proposed method to HIV dynamics data to illustrate the practicability of the estimator.  相似文献   
994.
Comparing the volume of the projection body of a double cone and that of the projection body of a ball, we give an explicit counter-example for the Shephard problem of convex bodies in Rn (n ≥ 3) and an affirmative answer to the question of Zhang.  相似文献   
995.
We study the order acceptance and scheduling problem on two identical parallel machines. At the beginning of the planning horizon, a firm receives a set of customer orders, each of which has a revenue value, processing time, due date, and tardiness weight. The firm needs to select orders to accept and schedule the accepted orders on two identical parallel machines so as to maximize the total profit. The problem is intractable, so we develop two heuristics and an exact algorithm based on some optimal properties and the Lagrangian relaxation technique. We evaluate the performance of the proposed solution methods via computational experiments. The computational results show that the heuristics are efficient and effective in approximately solving large-sized instances of the problem, while the exact algorithm can only solve small-sized instances.  相似文献   
996.
The effects of ultraviolet-C radiation (UV-C, 11.8?W/m2), single-cycle and multiple-cycle high hydrostatic pressure (HHP at 200, 400 or 600?MPa) on microbial load and physicochemical quality of raw milk were evaluated. Reductions of aerobic plate count (APC) and coliform count (CC) by HHP were more than 99.9% and 98.7%, respectively. Inactivation efficiency of microorganisms increased with pressure level. At the same pressure level, two-cycle treatments caused lower APC, but did not show CC differences compared with single-cycle treatments. Reductions of APC and CC by UV-C were somewhere between 200?MPa and 400/600?MPa. Both HHP and UV-C significantly decreased lightness and increased pH, but did not change soluble solids content and thiobarbituric acid-reactive substances’ values. Two 2.5?min cycles of HHP at 600?MPa caused minimum APC and CC, and maximum conductivity. Compared with HHP, UV-C markedly increased protein oxidation and reduced darkening.  相似文献   
997.
998.
999.
A facile microwave-assisted ethylene glycol method is developed to synthesize the SnO2 nanoparticles dispersed on or encapsulated in reduced graphene oxide (SnO2-rGO) hybrids. The morphology, structure, and composition of SnO2-rGO are investigated by scanning electron microscopy, transmission electron microscope, thermo-gravimetric analyzer, X-ray diffraction, Raman spectroscopy, and X-ray photoelectron spectroscopy. The electrochemical performance of SnO2-rGO as anode materials for lithium-ion batteries was tested by cyclic voltammetry, galvanostatic charge–discharge cycling, and rate capability test. It is found that the SnO2 nanoparticles with a uniform distribution have p-type doping effect with rGO nanosheets. The as-prepared SnO2-rGO hybrids exhibit remarkable lithium storage capacity and cycling stability, and the possible mechanism involved is also discussed. Their capacity is 1222 mAhg?1 in the first cycle and maintains at 700 mAhg?1 after 100 cycles. This good performance can be mainly attributed to the unique nanostructure, good structure stability, more space for volume expansion of SnO2, and mass transfer of Li+ during cycling.  相似文献   
1000.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号